On Rational Series and Rational Languages
نویسنده
چکیده
We study the connections between rational series with coeecients in a semiring and their languages.
منابع مشابه
Relevant Representations for the Inference of Rational Stochastic Tree Languages
Recently, an algorithm DEESwas proposed for learning rational stochastic tree languages. Given a sample of trees independently and identically drawn according to a distribution de ned by a rational stochastic language, DEES outputs a linear representation of a rational series which converges to the target. DEES can then be used to identify in the limit with probability one rational stochastic t...
متن کاملCharacterizations of recognizable picture series
The theory of two-dimensional languages as a generalization of formal string languages was motivated by problems arising from image processing and pattern recognition and also concerns models of parallel computing. In the nineties, Restivo and Giammarresi defined the family REC of recognizable picture languages [GR97]. This family is very robust and has been characterized by many different devi...
متن کاملLearning Rational Stochastic Tree Languages
We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees T (F), from a sample of trees independently drawn according to an unknown target P . We consider the case where the target is a rational stochastic tree language, i.e. it can be computed by a rational tree series or, equivalently, by a multiplicity tree automaton. In this paper, we ...
متن کاملA rational Chebyshev functions approach for Fredholm-Volterra integro-differential equations
The purpose of this study is to present an approximate numerical method for solving high order linear Fredholm-Volterra integro-differential equations in terms of rational Chebyshev functions under the mixed conditions. The method is based on the approximation by the truncated rational Chebyshev series. Finally, the effectiveness of the method is illustrated in several numerical examples. The p...
متن کاملUsing Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some class of probabilistic models such as probabilistic automata (PA). In this paper, we focus on probabilistic models based on multiplicity automata (MA). The stochastic languages generated by MA are called rational stocha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 205 شماره
صفحات -
تاریخ انتشار 1998